Qualitative Direction Calculi with Arbitrary Granularity

نویسندگان

  • Jochen Renz
  • Debasis Mitra
چکیده

Binary direction relations between points in two-dimensional space are the basis to any qualitative direction calculus. Previous calculi are only on a very low level of granularity. In this paper we propose a generalization of previous approaches which enables qualitative calculi with an arbitrary level of granularity. The resulting calculi are so powerful that they can even emulate a quantitative representation based on a coordinate system. We also propose a less powerful, purely qualitative version of the generalized calculus. We identify tractable subsets of the generalized calculus and describe some applications for which these calculi are useful.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending Binary Qualitative Direction Calculi with a Granular Distance Concept: Hidden Feature Attachment

In this paper we introduce a method for extending binary qualitative direction calculi with adjustable granularity like OPRAmor the star calculus with a granular distance concept. This method is similar to the concept of extending points with an internal reference direction to get oriented points which are the basic entities in the OPRAmcalculus. Even if the spatial objects are from a geometric...

متن کامل

Spatial reasoning with augmented points: Extending cardinal directions with local distances

We present an approach for supplying existing qualitative direction calculi with a distance component to support fully fledged positional reasoning. The general underlying idea of augmenting points with local reference properties has already been applied in the OPRAm calculus in which point objects are attached with a local reference direction to obtain oriented points and be able to express re...

متن کامل

GQR – A Fast Reasoner for Binary Qualitative Constraint Calculi

GQR (Generic Qualitative Reasoner) is a solver for binary qualitative constraint networks. GQR takes a calculus description and one or more constraint networks as input, and tries to solve the networks using the path consistency method and (heuristic) backtracking. In contrast to specialized reasoners, it offers reasoning services for different qualitative calculi, which means that these calcul...

متن کامل

Qualitative Reasoning about Relative Direction on Adjustable Levels of Granularity

An important issue in Qualitative Spatial Reasoning is the representation of relative direction. In this paper we present simple geometric rules that enable reasoning about relative direction between oriented points. This framework, the Oriented Point Algebra OPRAm, has a scalable granularity m. We develop a simple algorithm for computing the OPRAm composition tables and prove its correctness. ...

متن کامل

A Relative Orientation Algebra with Adjustable Granularity

The granularity of spatial calculi and the resulting mathematical properties have always been a major question in solving spatial tasks qualitatively. In this paper we present the Oriented Point Relation Algebra (OPRAm), a new orientation calculus with adjustable granularity. Since our calculus is a relation algebra in the sense of Tarski, fast standard inference methods can be applied. One of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004